Model Checking Systems and Specifications with Parameterized Atomic Propositions
نویسندگان
چکیده
In classical LTL model checking, both the system and the specification are over a finite set of atomic propositions. We present a natural extension of this model, in which the atomic propositions are parameterized by variables ranging over some (possibly infinite) domain. For example, by parameterizing the atomic propositions send and receive by a variable x ranging over possible messages, the specification G(send .x → Freceive.x) specifies that not only each send signal is followed by a receive signal, but also that the content of the received message agrees with the content of the one sent. Our extended setting consists of Variable LTL (VLTL) – a specification formalism that extends LTL with atomic propositions parameterized by variables, and abstract systems – systems in which atomic propositions may be parameterizedsystems – systems in which atomic propositions may be parameterized by variables. We study the model-checking problem in this setting. We show that while the general setting is undecidable, some useful special cases are decidable. In particular, for fragments of VLTL that restrict the quantification over the variables, the model checking is PSPACE-complete, and thus is not harder than the LTL model checking problem. The latter result conveys the strength and advantage of our setting.
منابع مشابه
An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications
We introduce generalized register automata (GRAs) and study their properties and applications in reasoning about systems and specifications over infinite domains. We show that GRAs can capture both VLTL – a logic that extends LTL with variables over infinite domains, and abstract systems – finite state systems whose atomic propositions are parameterized by variable over infinite domains. VLTL a...
متن کاملDecision problems for partial specifications: empirical and worst-case complexity
Partial specifications allow approximate models of systems such as Kripke structures, or labeled transition systems to be created. Using the abstraction possible with these models, an avoidance of the state-space explosion problem is possible, whilst still retaining a structure that can have properties checked over it. A single partial specification abstracts a set of systems, whether Kripke, l...
متن کاملModel Checking LTL over Controllable Linear Systems Is Decidable
The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata or rectangular hybrid systems. In this paper we enlarge the class of systems amenable to algorithmic analysis and synthesis by showing decidability of model checking Linear Temporal Logic (LTL) formulas over discrete time, contro...
متن کاملModel Checking Knowledge and Time via Local Propositions: Cooperative and Adversarial Systems
Model checking as an approach to the automatic verification of finite state systems has focused predominantly on system specifications expressed in temporal logic. In the distributed systems community, logics of knowledge (epistemic logics) have been advocated for expressing desirable properties of protocols and systems. A range of logics combining temporal and epistemic components have been de...
متن کاملLiveness of Parameterized Timed Networks
We consider the model checking problem of infinite state systems given in the form of parameterized discrete timed networks with multiple clocks. We show that this problem is decidable with respect to specifications given by Bor S-automata. Such specifications are very expressive (they strictly subsume ω-regular specifications), and easily express complex liveness and safety properties. Our res...
متن کامل